An Algorithm based on the Weighted Network Voronoi Diagram for Point Cluster Simplification
نویسندگان
چکیده
منابع مشابه
Point Cluster Simplification Using Weighted Voronoi Diagram
This paper proposes an algorithm for simplifying point features on maps based on the multiplicatively weighted Voronoi diagram (MWVD). To ensure statistical, thematic, metric, and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures to quantify these four types of information, and integra...
متن کاملAdditively Weighted Voronoi Diagram on the Oriented Projective Plane Additively Weighted Voronoi Diagram on the Oriented Projective Plane
We consider Voronoi diagrams deened on the oriented projective plane T 2. In this geometry, the closest and furthest site diagrams are antipodal. We give a simple on-line incremental algorithm for constructing the additively weighted diagram. This diagram, which may be disconnected in Euclidean plane, is always connected in T 2 and has exactly 3n ? 6 edges and 2n ? 4 vertices, where n is the nu...
متن کاملPoint-based Simplification Algorithm
This study presents a novel, rapid, and effective point simplification algorithm based on a point cloud without any normal and connectivity information. This study is initiated with a scattered sampled point set in three dimensions, and the final output is a triangular mesh model, which is simplified according to a restrictive criteria. The proposed method reduces the number of calculations req...
متن کاملVoronoi Diagram Generation Algorithm based on Delaunay Triangulation
Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis. Considering the low efficiency of the algorithm of indirectly building Voronoi diagram, this paper proposes an improved Voronoi diagram generation algorithm based on Delaunay triangulation of randomly distributed points in the Eu...
متن کاملThe weighted farthest color Voronoi diagram on trees and graphs
! " # %$ & #' )(* +, ( *. # $/( #0 213 4 " #65/ )( 7986 $. /$ : %(* ; % ;% %$ % " =<> %(* ? @ A B$ ;% # 7DC E F % $ , =$ ;% GIH KJ L@ @ M F# 4 F F = N $ % : ;%(* # /+O #, P$ * ) Q # $ % * L@ + ) SR9 # * ) * ) ) ( #0 -T % </ ) $0 B $. ' * % U + 1V ;% * )(* W P ) # (* % * A +W @ / =</ %$0 X % / ?$ ;% Q P +W P+Y )# ) Q ,$ *;% # 7
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS International Journal of Geo-Information
سال: 2019
ISSN: 2220-9964
DOI: 10.3390/ijgi8030105